منابع مشابه
Justifications for common knowledge
Justification logics are epistemic logics that explicitly include justifications for the agents’ knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting’s semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of o...
متن کاملRepresentation and Use of Explicit Justifications for Knowledge Base Refinements
We discuss the representation and use of justification structures as an aid to knowledge base refinement. We show how justifications can be used by a system to generate explanations – for its own use – of potential causes of observed failures. We discuss specific information that is usefully included in these justifications to allow the system to isolate potential faulty supporting beliefs for ...
متن کاملAn analysis of common ethical justifications for compassionate use programs for experimental drugs
BACKGROUND When a new intervention or drug is developed, this has to pass through various phases of clinical testing before it achieves market approval, which can take many years. This raises an issue for drugs which could benefit terminally ill patients. These patients might set their hopes on the experimental drug but are unable to wait since they are likely to pass away before the drug is av...
متن کاملLemmas for Justifications in OWL
Over the past few years there has been a significant amount of interest in the area of debugging and repairing of OWL ontologies. The process of debugging an ontology is necessary in the same way that debugging programme code is necessary – that is, debugging takes place in order to eradicate faults. In terms of ontology debugging, the faults manifest themselves as undesirable entailments. In p...
متن کاملDeduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula φ, the deduction chains of φ are built up by systematically decomposing φ into its subformulae. In the case where φ is a valid formula, the decomposition yields a (usually cut-free) proof of φ. If φ is not valid, the decomposition produces a countermodel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Non-Classical Logics
سال: 2011
ISSN: 1166-3081,1958-5780
DOI: 10.3166/jancl.21.35-60